Performance Contribution Based Scheduling Framework for Precedence Constraint Tasks in Real Time System
نویسنده
چکیده
Abstract: It is quite possible that in a process set, process may be having earliest deadline but its performance contribution is low in process set. Scheduling such processes with highest priority does not carry any meaning. Majority of today’s commercial operating system schedule task based on a single parameter however recent research on flexible scheduling showed that a single parameter is not enough to express all the application requirement .In order to provide effective support to QoS management ,an algorithm for offline scheduling of communicating tasks with precedence constraints suggested on uniprocessor Since in real time system processes are communicating to each other, if any message is failed then performance of executing successor process is reduced up to some extent .Contribution of each process in process network can be evaluated offline using multistate system (MSS) analysis. This paper suggests the policy to convert task precedence and communication constraints into pseudo deadlines of task. This scheduling policy is compared with latest deadline first (LDF).Major advantage of our policy is to support cyclic process network. Where as LDF supports acyclic process network.
منابع مشابه
On-line Scheduling Algorithm with Precedence Constraint in Embeded Real-time System
Function design of embedded real-time system introduced the problem of real-time task scheduling with precedence constraint which needs that scheduling sequence produced by algorithm satisfying not only real-time constraint of every task, but also precedence constraint among tasks. Based on parallel topological sort, this paper presents a new on-line scheduling algorithm OSA-RPC which can set p...
متن کاملA Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint
In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...
متن کاملHow to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling
Formal results for precedence constrained, real-time scheduling of unit time tasks are extended to arbitrary timed tasks with preemp-tion. An exact characterisation of the EDF-like schedulers that can be used to transparently enforce precedence constraints among tasks is shown. These extended results are then integrated with a well-known protocol that handles real-time scheduling of tasks with ...
متن کاملAn improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملMixed real-time scheduling of multiple DAGs-based applications on heterogeneous multi-core processors
As multi-core processors continue to scale, more and more multiple distributed applications with precedence-constrained tasks simultaneously and widely exist in multi-functional embedded systems. Scheduling multiple DAGs-based applications on heterogeneous multi-core processors faces conflicting high-performance and real-time requirements. This study presents a multiple DAGs-based applications ...
متن کامل